A Reliable Schedule with Budget Constraints in Grid Computing
نویسندگان
چکیده
The application system while executing in a Grid environment may encounter a failure. This phenomenon can be overcome by a reliable scheduler who plays the major role of allocating the applications to the reliable resources based on the reliability requirement of the applications given by the users. The reliability requirement considered in this paper is deadline and budget which is also the quality of service requirement needed for the applications. In this paper, based on deadline and budget as a main factor the tasks are scheduled to the reliable processors.
منابع مشابه
Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملScheduling scientific workflow applications with deadline and budget constraints using genetic algorithms
Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models, which are capable of supporting diverse computing services. It facilitates scientific applications to take advantage of computing resources distributed world wide to enhance the capability and performance. Many scientific applications in areas s...
متن کاملScheduling Workflows with Budget Constraints^
Grids are emerging as a promising solution for resource and computation demanding applications. However, the heterogeneity of resources in Grid computing, complicates resource management and scheduling of applications. In addition, the commercialization of the Grid requires policies that can take into account user requirements, and budget considerations in particular. This paper considers a bas...
متن کاملA Budget and Deadline Constrained Fault Tolerant Load Balanced Scheduling Algorithm for Computational Grids
Grid is an environment with millions of resources which are dynamic and heterogeneous in nature. A computational grid is one in which the resources are computing nodes and is meant for applications that involves larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Resource allocation is a tedi...
متن کاملDynamic Scheduling of Independent Tasks with a Budget Constraint on a Desktop Grid
In an Internet desktop grid, the computing power may be leveraged by providing economic incentive for computer owners. Using batch mode scheduling heuristics, such as MinMin, MaxMin or Sufferage, this paper describes an algorithm that performs independent task scheduling on a large scale heterogeneous system, with a budget constraint. Under the restriction of never exceeding a periodically refr...
متن کامل